Numerical experiments with LP formulations of the maximum clique problem
نویسندگان
چکیده
Abstract The maximum clique problems calls for determining the size of largest in a given graph. This graph problem affords number zero-one linear programming formulations. In this case study we deal with some these We consider ways tightening carry out numerical experiments to see improvements tightened formulations provide.
منابع مشابه
The Maximum Edge Weight Clique Problem: Formulations and Solution Approaches
Given an edge-weighted graph, the maximum edge weight clique (MEWC) problem is to find a clique that maximizes the sum of edge weights within the corresponding complete subgraph. This problem generalizes the classical maximum clique problem and finds many real-world applications in molecular biology, broadband network design, pattern recognition and robotics, information retrieval, marketing, a...
متن کاملThe maximum clique problem
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
متن کاملThe Maximum Clique Problem
Description Given an undirected graph G = ( V, E ), a clique S is a subset of V such that for any two elements u, v ∈ S, ( u, v ) ∈ E. Using the notation ES to represent the subset of edges which have both endpoints in clique S, the induced graph GS = ( S, ES ) is complete. Finding the largest clique in a graph is an NP-hard problem, called the maximum clique problem (MCP). Cliques are intimate...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the maximum edge-weight clique problem in sparse graphs with compact formulations
This paper proposes compact formulations for the maximum edge-weight clique (MEWC) problem on sparse graphs. The MEWC problem has long been discussed in the literature, but mostly addressing complete graphs, with or without a cardinality constraint on the clique. Yet, several realworld applications are defined on sparse graphs, where the missing edges are due to some thresholding process or bec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2021
ISSN: ['1613-9178', '1435-246X']
DOI: https://doi.org/10.1007/s10100-021-00776-z